Predicate and Relation Lifting for Parametric Algebraic Specifications
نویسنده
چکیده
Relation lifting [6] extends an endofunctor F : C //C to a functor Rel(F ) : Rel(C) //Rel(C), where Rel(C) is a suitable category of relations over C. The relation lifting for the functor F can be used to define the notion of bisimulation for coalgebras X //F (X). The related notion of predicate lifting can be used to define invariants for F–coalgebras. Predicate and relation lifting can be directly defined for a rich class of polynomial functors [5,6,19]. In this paper I investigate the case where the functor F is defined as the initial semantics of a (single sorted) parametric algebraic specification.
منابع مشابه
Specification Refinement with System F - The Higher-Order Case
A type-theoretic counterpart to the notion of algebraic specification refinement is discussed for abstract data types with higher-order signatures. The type-theoretic setting consists of System F and the logic for parametric polymorphism of Plotkin and Abadi. For first-order signatures, this setting immediately gives a natural notion of specification refinement up to observational equivalence v...
متن کاملNondeterministic Algebraic Specifications and Nonconfluent Term Rewriting
Algebraic specifications are generalized to the case of nondeterministic operations by admitting models with set-valued functions (multi-algebras). General (in particular, non-confluent) term rewriting systems are studied as a specification language for this semantic framework. A calculus for nondeterministic specifications is given which is similar to term rewriting but which employs an additi...
متن کاملPredicate Transformers and Linear Logic: Yet Another Denotational Model
In the refinement calculus, monotonic predicate transformers are used to model specifications for (imperative) programs. Together with a natural notion of simulation, they form a category enjoying many algebraic properties. We build on this structure to make predicate transformers into a denotational model of full linear logic: all the logical constructions have a natural interpretation in term...
متن کاملLax Extensions of Coalgebra Functors
We discuss the use of relation lifting in the theory of setbased coalgebra. On the one hand we prove that the neighborhood functor does not extend to a relation lifting of which the associated notion of bisimilarity coincides with behavorial equivalence. On the other hand we argue that relation liftings may be of use for many other functors that do not preserve weak pullbacks, such as the monot...
متن کاملOrder-Sorted Equality Enrichments Modulo Axioms
Built-in equality and inequality predicates based on comparison of canonical forms in algebraic specifications are frequently used because they are handy and efficient. However, their use places algebraic specifications with initial algebra semantics beyond the pale of theorem proving tools based, for example, on explicit or inductionless induction techniques, and of other formal tools for chec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 106 شماره
صفحات -
تاریخ انتشار 2004